A Graph Reduction Technique and an Extension to the G - Machine forPure
نویسندگان
چکیده
We present a graph reduction technique for the implementation of functional-logic languages. Our technique, called quasisharing, attempts to provide a maximum degree of sharing between alternative narrowings while still admitting a reasonable compilation. Quasisharing resembles aspects of an algorithm of Lamping for optimal reduction in the lambda calculus. We also describe an extension to the G-machine which implements quasisharing.
منابع مشابه
Malware Detection using Classification of Variable-Length Sequences
In this paper, a novel method based on the graph is proposed to classify the sequence of variable length as feature extraction. The proposed method overcomes the problems of the traditional graph with variable length of data, without fixing length of sequences, by determining the most frequent instructions and insertion the rest of instructions on the set of “other”, save speed and memory. Acco...
متن کاملAn Extension to the Economic Production Quantity Problem with Deteriorating Products Considering Random Machine Breakdown and Stochastic Repair Time
The recent advances in manufacturing systems motivate several studies to focus on Economic Production Quantity (EPQ) problem. Althuogh there are several extentions to the EPQ, this paper provides a new extension by considering some of the real world parameters like: (a) shortages in the form of partial backordering, (b) inventory can deteriorate stochastically, (c) machine can break down stocha...
متن کاملOn the planarity of a graph related to the join of subgroups of a finite group
Let $G$ be a finite group which is not a cyclic $p$-group, $p$ a prime number. We define an undirected simple graph $Delta(G)$ whose vertices are the proper subgroups of $G$, which are not contained in the Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge if and only if $G=langle H , Krangle$. In this paper we classify finite groups with planar graph. ...
متن کاملSOME RESULTS ON THE COMPLEMENT OF THE INTERSECTION GRAPH OF SUBGROUPS OF A FINITE GROUP
Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...
متن کاملA Note on a graph associated to a commutative ring
The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings. In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$. In Section 2 of this articl...
متن کامل